Concept Lattice Reduction by Singular Value Decomposition
نویسندگان
چکیده
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexity plays significant role when computing all concepts from a huge incidence matrix. In this paper we try to modify an incidence matrix using matrix decomposition, creating a new matrix with fewer dimensions as an input for some known algorithms for lattice construction. Results are presented by visualising neural network. Neural network is responsive for reducing result dimension to two dimensional space and we are able to present result as a picture that we are able to analyse.
منابع مشابه
Concept Lattice Generation by Singular Value Decomposition
Latent semantic indexing (LSI) is an application of numerical method called singular value decomposition (SVD), which discovers latent semantic in documents by creating concepts from existing terms. The application area is not limited to text retrieval, many applications such as image compression are known. We propose usage of SVD as a possible data mining method and lattice size reduction tool...
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملEqualization Strategie for Transmission over Space and Time
An overview on equalization schemes applicable for point-to-point communication over MIMO ISI channels is given, i.e., channels which suffer form both, multiuser interference between the data streams transmitted in parallel and intersymbol interference due to the dispersive (frequencyselective) nature of the channel. Spatial, temporal and combined spatial/temporal equalization strategies for de...
متن کاملNoise Effects on Modal Parameters Extraction of Horizontal Tailplane by Singular Value Decomposition Method Based on Output Only Modal Analysis
According to the great importance of safety in aerospace industries, identification of dynamic parameters of related equipment by experimental tests in operating conditions has been in focus. Due to the existence of noise sources in these conditions the probability of fault occurrence may increases. This study investigates the effects of noise in the process of modal parameters identification b...
متن کامل